Dense Minors In Graphs Of Large Girth
نویسندگان
چکیده
We show that a graph of girth greater than 6 log k + 3 and minimum degree at least 3 has a minor of minimum degree greater than k. This is best possible up to a factor of at most 9/4. As a corollary, every graph of girth at least 6 log r + 3 log log r + c and minimum degree at least 3 has a Kr minor.
منابع مشابه
Minors in graphs of large pumpkin-girth
For every r ∈ N, let θr denote the graph with two vertices and r parallel edges. The θr-girth of a graph G is the minimum number of edges of a subgraph of G that can be contracted to θr. This notion generalizes the usual concept of girth which corresponds to the case r = 2. In [Minors in graphs of large girth, Random Structures & Algorithms, 22(2):213–225, 2003], Kühn and Osthus showed that gra...
متن کاملHigh-Girth Graphs Avoiding a Minor are Nearly Bipartite
Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...
متن کاملTopological Minors in Graphs of Large Girth
We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of Krþ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! os that every graph of chromatic number at least r contains a subdivision of Kr (which is false in general) is true for graphs of girth at least 186 (or 15 if r5436). More generally, we show tha...
متن کاملComplete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this theorem to show that for any fixed k a random cubic graph contains a Kk-minor asymptotically almost surely.
متن کاملMore on random graphs and discrepancy for directed graphs
Consider the following problem: Does there exist a graph with large girth and large chromatic number? The girth of a graph is the length of the shortest cycle and the chromatic number is the minimum number of colors needed to color the vertices of the graph so no two adjacent vertices have the same color. These two conditions seem contradictory, intuitively to have high chromatic number we need...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 25 شماره
صفحات -
تاریخ انتشار 2004